Self-avoiding walks on diluted networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-avoiding walks on diluted networks.

It is shown that, contrary to recent suggestions, the exponent ν, characterizing self-avoiding walks in a diluted lattice at the percolation threshold is determined by a fixed point, different from the pure-lattice one. The full phase diagram of this system is obtained by a real-space renormalization-group treatment and five nontrivial fixed points are identified. A field-theoretical treatment ...

متن کامل

Self-avoiding Walks on Random Networks of Resistors and Diodes

We study the self-avoiding walks (SAW) on a square lattice whose various degrees of randomness encompasses many different random networks, including the incipient clusters of the directed, mixed and isotropic bond percolation. We apply the position-space renormalization group (PSRG) method and demonstrate that within the framework of this method one is bound to find that the critical exponent v...

متن کامل

Anisotropic Self - Avoiding Walks

We consider a model of self-avoiding walks on the lattice Zd with different weights for steps in each of the 2d lattice directions. We find that the directiondependent mass for the two-point function of this model has three phases: mass positive in all directions; mass identically −∞; and masses of different signs in different directions. The final possibility can only occur if the weights are ...

متن کامل

Prudent Self-Avoiding Walks

We have produced extended series for prudent self-avoiding walks on the square lattice. These are subsets of self-avoiding walks. We conjecture the exact growth constant and critical exponent for the walks, and show that the (anisotropic) generating function is almost certainly not differentiably-finite.

متن کامل

Extendable Self-avoiding Walks

The connective constant μ of a graph is the exponential growth rate of the number of n-step self-avoiding walks starting at a given vertex. A self-avoiding walk is said to be forward (respectively, backward) extendable if it may be extended forwards (respectively, backwards) to a singly infinite self-avoiding walk. It is called doubly extendable if it may be extended in both directions simultan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review Letters

سال: 1989

ISSN: 0031-9007

DOI: 10.1103/physrevlett.63.2819